A Proposal of Fuzzy Connectives with Learning Function Using Steepest Descent Method
نویسندگان
چکیده
منابع مشابه
Efficient perceptron learning using constrained steepest descent
An algorithm is proposed for training the single-layered perceptron. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassified patterns. The problem of finding these directions is stated as a quadratic programming task, to which a fast and effective solution is proposed. The resulting algori...
متن کاملEecient Perceptron Learning Using Constrained Steepest Descent Running Title: Eecient Perceptron Learning 1 Eecient Perceptron Learning Using Constrained Steepest Descent
| An algorithm is proposed for training the single-layered per-ceptron. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassiied patterns. The problem of nding these directions is stated as a quadratic programming task, to which a fast and eeective solution is proposed. The resulting algorit...
متن کاملA limited memory steepest descent method
The possibilities inherent in steepest descent methods have been considerably amplified by the introduction of the Barzilai-Borwein choice of step-size, and other related ideas. These methods have proved to be competitive with conjugate gradient methods for the minimization of large dimension unconstrained minimization problems. This paper suggests a method which is able to take advantage of th...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 1993
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.5.5_1132